Computationally Manageable Combinational Auctions
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
Computationally Manageable Combinatorial Auctions for Supply Chain Automation
xxi Acknowledgements xxiii
متن کاملComputationally Manageable Combinatorial Auctions the Authors Gratefully Acknowledge the National Science Foundation for Its Support under Grant Number Sbr 93-09333 to Rutgers University Aliated Graduate Student Member, Dimacs Graduate Assistant
There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of noncon icting bids can be a di cult one. We analyze this problem, identifying sev...
متن کاملReliability Study of Combinational Circuitsy
An exact, practical implementation of reliability calculation for combinational circuits can be based on a hierarchical decomposition of the circuit into manageable sub{units, and construction of exact summary tables for each sub{unit. For a simple example of voting logic, this exact reliability analysis reaarms that the reliability of the individual voter inputs is as important as the voter re...
متن کاملIncompletely Specified Combinatorial Auctions
The popularity of auctions has increased dramatically with their introduction on the Internet. This migration has provided a unique opportunity to harness the power of computing to create new auction forms that were previously impossible. We describe a new type of combinatorial auction that accepts incompletely specified bids that provide a framework to guide, rather than dictate, the choice of...
متن کاملCAMBO: Combinatorial Auctions using Matrix Bids with Order
Since combinational auctions allow bidders to bid on any combination of goods, bid data can be of exponential size. To combat this problem, restrictions have been proposed limiting the number of bundles a bidder is allowed to bid on (as in FCC Auction #31). We describe a new combinatorial auction format that restricts bidders to submit a fixed number of “matrix bids with order”. The advantage o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007